A simple algorithm for GCD of polynomials
نویسندگان
چکیده
Based on the Bezout approach we propose a simple algorithm to determine gcd of two polynomials that don't need division, like Euclidean algorithm, or determinant calculations, Sylvester matrix algorithm. The needs only n steps for degree n. Formal manipulations give discriminant resultant any without needing division calculation.
منابع مشابه
Approximate GCD of Multivariate Polynomials
Given two polynomials F and G in R[x1, . . . , xn], we are going to find the nontrivial approximate GCD C and polynomials F , G ∈ R[x1, . . . , xn] such that ||F − CF ′|| < and ||G − CG′|| < , for some and some well defined norm. Many papers 1,2,3,5,8,10,11,13,15 have already discussed the problem in the case n = 1. Few of them 2,10,11 mentioned the case n > 1. Approximate GCD computation of un...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملGCD and Factorisation of multivariate polynomials
Some widely known techniques can be used to factorise univariate polynomials over the domain of integers. However, finding algorithms which factorise univariate and multivariate polynomials over Z and other domains is a little trickier. Several factorisation algorithms first need GCDs of the polynomials. Computing GCDs of polynomials is also necessary for adding rational functions. Both problem...
متن کاملA modular integer GCD algorithm
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U , V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC ’93: International Symposium on Symbolic and Algebr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of mathematics and physics
سال: 2022
ISSN: ['2689-7636']
DOI: https://doi.org/10.17352/amp.000065